Texture synthesis using label assignment over a graph

نویسندگان

  • Jack Caron
  • David Mould
چکیده

Partition of unity parametrics (PUPs) are a recent framework designed for geometric modeling. We propose employing PUPs for procedural texture synthesis, taking advantage of the framework’s guarantees of high continuity and local support. Using PUPs to interpolate among data values distributed through the plane, the problem of texture synthesis can be approached from the perspective of point placement and attribute assignment; a graph over the points, such as the Delaunay triangulation, allows us to apply attributes or labels to the nodes in a structured way. We present several alternative mechanisms for point distribution and demonstrate how the system is able to produce a variety of distinct classes of texture, including analogs to cellular texture, Perlin noise, and progressively-variant textures. We further describe structured textures obtained by assigning label clusters using queries over the graph, such as breadth-first or depth-first traversal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total vertex irregularity strength of corona product of some graphs

A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...

متن کامل

Analyzing the layout of composite textures

The synthesis of many textures can be simplified if they are first decomposed into simpler subtextures. Such bootstrap procedure allows to first consider a ‘label texture’, that captures the layout of the subtextures, after which the subtextures can be filled in. A companion paper focuses on this latter aspect. This paper describes an approach to arrive at the label texture. Pairwise pixel simi...

متن کامل

RestoCut: Reconstruction of regular images using graph cuts

In this paper new approach to reconstruct images, removing unwanted objects from it, is described. The main idea of the introduced approach is to generate texture over unwanted object using graph cut based texture synthesis algorithm. Different texture synthesis techniques are briefly covered, while used technique is described in detail. After that, migration from the texture synthesis problem ...

متن کامل

Video Completion Using Global Optimization

Video completion is a computer vision technique to restore the holes in video sequences due to removal of the dynamic or static foreground object by filling the unknown region with the known information. In this paper, a novel algorithm for video completion of large holes in video sequences is proposed. Video completion is treated as a global optimization problem by enforcing the spatial-tempor...

متن کامل

Natural scene synthesis using multiple eigenspaces

Although significant research effort has been devoted to the natural scene analysis, there hasn’t been much work on natural scene synthesis. The research of such nature can help understand the hidden structure of natural texture and the illumination patterns for classification and segmentation purposes. The common texture synthesis methods are not suitable for natural scene synthesis due to inh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2014